ar X iv : 0 80 4 . 07 22 v 2 [ cs . D S ] 1 1 N ov 2 00 8 A Memetic Algorithm for the Generalized Traveling Salesman Problem ∗
نویسندگان
چکیده
The generalized traveling salesman problem (GTSP) is an extension of the well-known traveling salesman problem. In GTSP, we are given a partition of cities into groups and we are required to find a minimum length tour that includes exactly one city from each group. The recent studies on this subject consider different variations of a memetic algorithm approach to the GTSP. The aim of this paper is to present a new memetic algorithm for GTSP with a powerful local search procedure. The experiments show that the proposed algorithm clearly outperforms all of the known heuristics with respect to both solution quality and running time. While the other memetic algorithms were designed only for the symmetric GTSP, our algorithm can solve both symmetric and asymmetric instances.
منابع مشابه
ar X iv : 0 80 4 . 07 22 v 1 [ cs . D S ] 4 A pr 2 00 8 A Memetic Algorithm for the Generalized Traveling Salesman Problem ∗
The generalized traveling salesman problem (GTSP) is an extension of the well-known traveling salesman problem. In GTSP, we are given a partition of cities into groups and we are required to find a minimum length tour that includes exactly one city from each group. The recent studies on this subject consider different variations of a memetic algorithm approach to the GTSP. The aim of this paper...
متن کاملar X iv : 0 80 3 . 09 29 v 4 [ cs . D S ] 1 8 N ov 2 00 9 Graph Sparsification by Effective Resistances ∗
We present a nearly-linear time algorithm that produces high-quality spectral sparsifiers of weighted graphs. Given as input a weighted graph G = (V, E, w) and a parameter ! > 0, we produce a weighted subgraph H = (V, Ẽ, w̃) of G such that |Ẽ| = O(n log n/!) and for all vectors x ∈ R (1 − !) ∑ uv∈E (x(u) − x(v))2wuv ≤ ∑ uv∈Ẽ (x(u) − x(v))2w̃uv ≤ (1 + !) ∑ uv∈E (x(u) − x(v))2wuv. (1) This improves...
متن کاملBetter Approximation Algorithms for Maximum Asymmetric Traveling Salesman and Shortest Superstring
In the maximum asymmetric traveling salesman problem (Max ATSP) we are given a complete directed graph with nonnegative weights on the edges and we wish to compute a traveling salesman tour of maximum weight. In this paper we give a fast combinatorial 3 4 -approximation algorithm for Max ATSP. It is based on a novel use of half-edges, matchings and a new method of edge coloring. (A half-edge of...
متن کاملNew Heuristic Algorithms for Solving Single-Vehicle and Multi-Vehicle Generalized Traveling Salesman Problems (GTSP)
Among numerous NP-hard problems, the Traveling Salesman Problem (TSP) has been one of the most explored, yet unknown one. Even a minor modification changes the problem’s status, calling for a different solution. The Generalized Traveling Salesman Problem (GTSP)expands the TSP to a much more complicated form, replacing single nodes with a group or cluster of nodes, where the objective is to fi...
متن کاملar X iv : 0 80 8 . 01 63 v 1 [ cs . D S ] 1 A ug 2 00 8 Twice - Ramanujan Sparsifiers ∗
We prove that for every d > 1 and every undirected, weighted graph G = (V, E), there exists a weighted graph H with at most ⌈d |V |⌉ edges such that for every x ∈ IR , 1 ≤ x T LHx x LGx ≤ d + 1 + 2 √ d d + 1 − 2 √ d , where LG and LH are the Laplacian matrices of G and H , respectively.
متن کامل